A process algebra with distributed priorities

A Process Algebra with Distributed Priorities

This paper presents a process algebra for distributed systems in which some actions may take precedence over others. In contrast with existing approaches to priorities, our algebra only allows actions to preempt others at the same \location" and therefore captures a notion of localized precedence. Using Park's and Milner's notion of strong bisimulation as a basis, we develop a behavioral congru...

A Process Algebra of Communicating Shared Resources with Dense Time and Priorities

The correctness of real-time distributed systems depends not only on the function they compute but also on their timing characteristics. Furthermore, these characteristics are strongly influenced by the delays due to synchronization and resource availability. Process algebras have been used successfully to define and prove correctness of distributed systems. More recently, there has been a lot ...

Process Algebra with Backtracking

An extension of process algebra for modelling processes with backtracking is introduced. This extension is semantically based on processes that transform data because, in our view, backtracking is the undoing of the eeects caused by a process in some initial data-state if this process fails. The data-states are given by a data environment, which is a structure that also deenes in which data-sta...

Process Algebra with Iteration

We introduce iteration in process algebra by means of (the binary version of) Kleene's star operator: x y is the process that chooses between x and y, and upon termination of x has this choice again. It is proved that adding respectively interleaving, communication and abstraction operators increases expressivity up to the regular processes. However, if the distinction between (successful) term...

Process Algebra with Recursive